Solving the Dynamic User Optimal Assignment Problem Considering Queue Spillback
نویسندگان
چکیده
This paper studies the dynamic user optimal (DUO) traffic assignment problem considering simultaneous route and departure time choice. The DUO problem is formulated as a discrete variational inequality (DVI), with an embeded LWR-consistent mesoscopic dynamic network loading (DNL) model to encapsulate traffic dynamics. The presented DNL model is capable of capturing realistic traffic phenomena such as queue spillback. Various VI solution algorithms, particularly those based on feasible directions and a line search, are applied to solve the formulated DUO problem. Two examples are constructed to check equilibrium solutions obtained from numerical algorithms, to compare the performance of the algorithms, and to study the impacts of traffic interacts across multiple links on equilibrium solutions.
منابع مشابه
A Mixed Integer Linear Program for the Single Destination System Optimum Dynamic Traffic Assignment Problem with Physical Queue
In order to solve the system optimum dynamic traffic assignment problem, the whole link model with physical queue is used to formulate the single destination system optimum dynamic traffic assignment problem as a mixed linear program. A relationship between the cumulative curves and the wave speed presented by Newell (1993) is used to present a dynamic network model in considering spillback que...
متن کاملAn implicit path enumeration model and algorithm for dynamic traffic assignment with congestion spillback
A new continuous formulation of Dynamic Traffic Assignment, where a user equilibrium is expressed as a fixed point problem in terms of arc flow temporal profiles, is proposed. The precise aim of the paper is to integrate spillback modelling into an existing formulation of DTA, based on implicit path enumeration, which is capable of representing explicitly the formation and dispersion of vehicle...
متن کاملSpillback congestion in dynamic traffic assignment : a macroscopic flow model with time - varying bottlenecks
In this paper, we propose a new model for the within-day Dynamic Traffic Assignment (DTA) on road networks in which we explicitly address the simulation of queue spillovers where a user equilibrium is expressed as a fixed-point problem in terms of arc flow temporal profiles, i.e., in the infinite dimension space of time’s functions. The model integrates spillback congestion into an existing for...
متن کاملA Benders\' Decomposition Based Solution Method for Solving User Equilibrium Problem: Deterministic and Stochastic Cases
The traffic assignment problem is one of the most important problems for analyzing and optimizing the transportation network to find optimal flows. This study presented a new formulation based on a generalized Benders' decomposition approach to solve its important part, i.e. user equilibrium problems, in deterministic and stochastic cases. The new approach decomposed the problem into a master p...
متن کاملInfluence of Spillback Effect on Dynamic Shortest Path Problems with Travel-Time-Dependent Network Disruptions
Traffic network disruptions lead to a significant increase in travel time and hence transportation costs. An efficient routing model requires a good description of the congestion dynamics. One of these dynamics is the spillback effect, i.e. congestion propagation to upstream links. This leads to a secondary delay in the upstream road where the speed of the vehicles in the upstream road decrease...
متن کامل